منابع مشابه
Faster Approximate Agreement with Multi-Writer Registers
We consider the complexity of the wait-free approximate agreement problem in an asynchronous shared memory comprised of only single-bit multi-writer multi-reader registers. For real-valued inputs of magnitude at most s and a real-valued accuracy requirement " > 0 we show matching upper and lower bounds of (log(s=")) steps and shared registers. For inputs drawn from any xed nite range this is si...
متن کاملOn Interprocess Communication and the Implementation of Multi-Writer Atomic Registers
Two protocols for implementing n-writer m-reader atomic registers with 1-writer m-reader atomic registers are described. In order to give complete proofs, a theory of interprocess communication is presented rst. The correctness of a protocol that implements an atomic register is proved here in two stages: (1) A formulation of higher-level spec-iications and a proof that the protocol satisses th...
متن کاملStep Optimal Implementations of Large Single-Writer Registers
We present two wait-free algorithms for simulating an `-bit single-writer register from k-bit single-writer registers, for any k ≥ 1. Our first algorithm has Θ(`/k) step complexity for both Read and Write and uses Θ(4`−k) registers. An interesting feature of the algorithm is that Read operations do not write to shared variables. Our second algorithm has Θ(`/k+ (logn)/k) step complexity for both...
متن کاملOptimal Multi - Writer Multi - Reader Atomic RegisterAmos
This paper addresses the wide gap in space complexity of atomic, multi-writer, multi-reader register implementations. While the space complexity of all previous implementations is linear, the lower bounds are logarithmic. We present two implementations which close this gap: The rst implementation uses multi-reader physical registers while the second uses single-reader physical registers. Both i...
متن کاملGossiping and Broadcasting vs. Computing Boolean Functions in Processor Networks Faith Fich Faster Approximate Agreement with Multi-writer Registers
Contention Resolution in Hashing Based Shared Memory Simulations by Artur Czumaj (joint work with F. Meyer auf der Heide and Volker Stemann) We investigate the problem of simulating shared memory on the Distributed Memory Machine (DMM). Our approach uses multiple copies of shared memory cells distributed among the memory modules of the DMM via universal hashing. Thus the main problem is to desi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 1994
ISSN: 0178-2770,1432-0452
DOI: 10.1007/bf02280833